Nonsolvable IC groups

Diameters of Degree Graphs of Nonsolvable Groups

Four-Vertex Degree Graphs of Nonsolvable Groups

For a finite group G, the character degree graph ∆(G) is the graph whose vertices are the primes dividing the degrees of the ordinary irreducible characters of G, with distinct primes p and q joined by an edge if pq divides some character degree of G. We determine all graphs with four vertices that occur as ∆(G) for some nonsolvable group G. Along with previously known results on character degr...

Nonsolvable Groups Satisfying the One-Prime Hypothesis

Throughout this paper, G is a finite group and Irr(G) is the set of irreducible characters of G. We are particularly interested in the values these characters take on the identity of G. If χ ∈ Irr(G), then χ(1) is the degree of χ. The set of all degrees for G is written cd(G) = {χ(1) |χ ∈ Irr(G)}. In recent years, there has been much interest in finding connections between the structure of a fi...

Nonsolvable groups with few character degrees

Connectedness of Degree Graphs of Nonsolvable Groups